Equivalence betweenp-cyclic quasimonotonicity andp-cyclic monotonicity of affine maps
نویسندگان
چکیده
منابع مشابه
Regular cyclic coverings of regular affine maps
The regular coverings of regular affine algebraic maps are considered, and a large family of totally ramified coverings—the so-called Steinberg and Accola coverings—are fully classified.
متن کاملOn cyclic and n-cyclic monotonicity of bifunctions
In the recent literature, the connection between maximal monotone operators and the Fitzpatrick function is investigated. Subsequently, this relation has been extended to maximal monotone bifunctions and their Fitzpatrick transform. In this paper we generalize some of these results to maximal n-cyclically monotone and maximal cyclically monotone bifunctions, by introducing and studying the Fitz...
متن کاملEstimating Multinomial Choice Models Using Cyclic Monotonicity
This paper proposes a new identification and estimation approach to semi-parametric multinomial choice models that easily applies to not only cross-sectional settings but also panel data settings with unobservable fixed effects. Our approach is based on cyclic monotonicity, which is a defining feature of the random utility framework underlying multinomial choice models. From the cyclic monotoni...
متن کاملFitzpatrick functions, cyclic monotonicity and Rockafellar’s antiderivative
Several deeper results on maximal monotone operators have recently found simpler proofs using Fitzpatrick functions. In this paper, we study a sequence of Fitzpatrick functions associated with a monotone operator. The first term of this sequence coincides with the original Fitzpatrick function, and the other terms turn out to be useful for the identification and characterization of cyclic monot...
متن کاملCyclic orders: Equivalence and duality
Cyclic orders of graphs and their equivalence have been promoted by Bessy and Thomassés recent proof of Gallai’s conjecture. We explore this notion further : we prove that two cyclic orders are equivalent if and only if the winding number of every circuit is the same in the two. The proof is short and provides a good characterization and a polynomial algorithm for deciding whether two orders ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization
سال: 2014
ISSN: 0233-1934,1029-4945
DOI: 10.1080/02331934.2014.891031